DISCREPANCY OF A CONVEX SET WITH ZERO CURVATURE AT ONE POINT
نویسندگان
چکیده
منابع مشابه
Convex land acquisition with zero ^ one programming
The land-acquisition problem involves selecting multiple discrete parcels to be acquired for a particular land use. In previous models, typical selection criteria have been land cost, land area, and spatial attributes such as contiguity and compactness. Here I introduce a new spatial attribute, convexity. I develop a way to approximate convex shapes in continuous space with `cellularly convex' ...
متن کاملMinimum Weight Convex Quadrangulation of a Constrained Point Set
A convex quadrangulation with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of S, and every bounded interior face is convex and has four points from S on its boundary. A minimum weight convex quadrangulation with respect to S is a convex quadrangulation of S such that the sum...
متن کاملMinimum convex partition of a constrained point set
A convex partition with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of S, and every bounded interior face is a convex polygon. A minimum convex partition with respect to S is a convex partition of S such that the number of convex polygons is minimised. In this paper, we wil...
متن کاملComputing the convex hull of a planar point set
In Figure 1, the set S consists of thirteen points. The output of a convex hull algorithm should be the list (p1, p2, p3, p4, p5, p6). We remark that the list storing the vertices of CH (S) can start with an arbitrary vertex. In the example, the list (p3, p4, p5, p6, p1, p2) would also be a valid output. ∗School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6. E-mail: ...
متن کاملGuarding the Convex Subsets of a Point-set
A point in the plane is called a guard for the convex set C if it lies in the interior of C. Let P be a planar point-set. A set S of points is a k-convex guard set for P if every convex k-gon formed from points of P contains a guard from S. We study, for any integer k 3, the minimum size of a k-convex guard set of a given planar point-set of size n. We give the tight bounds for the case k = 3, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2020
ISSN: 0025-5793,2041-7942
DOI: 10.1112/mtk.12023